Life-Span Development of Brain Network Integration Assessed with Phase Lag Index Connectivity and Minimum Spanning Tree Graphs
نویسندگان
چکیده
Graph analysis of electroencephalography (EEG) has previously revealed developmental increases in connectivity between distant brain areas and a decrease in randomness and increased integration in the brain network with concurrent increased modularity. Comparisons of graph parameters across age groups, however, may be confounded with network degree distributions. In this study, we analyzed graph parameters from minimum spanning tree (MST) graphs and compared their developmental trajectories to those of graph parameters based on full graphs published previously. MST graphs are constructed by selecting only the strongest available connections avoiding loops, resulting in a backbone graph that is thought to reflect the major qualitative properties of the network, while allowing a better comparison across age groups by avoiding the degree of distribution confound. EEG was recorded in a large (n = 1500) population-based sample aged 5-71 years. Connectivity was assessed using phase lag index to reduce effects of volume conduction. Connectivity in the MST graph increased significantly from childhood to adolescence, continuing to grow nonsignificantly into adulthood, and decreasing significantly about 57 years of age. Leaf number, degree, degree correlation, and maximum centrality from the MST graph indicated a pattern of increased integration and decreased randomness from childhood into early adulthood. The observed development in network topology suggested that maturation at the neuronal level is aimed to increase connectivity as well as increase integration of the brain network. We confirm that brain network connectivity shows quantitative changes across the life span and additionally demonstrate parallel qualitative changes in the connectivity pattern.
منابع مشابه
Life-span development of functional brain networks as assessed with minimum spanning tree analysis of resting state EEG
The brain matures with large quantitative changes in anatomy and function. Graph analysis of EEG has previously revealed increased connectivity between distant brain areas and a decrease in randomness and increased integration in the brain network with concurrent increased modularity. Comparisons of graph parameters across age groups, however, may be confounded with network degree distributions...
متن کاملGraph analysis of EEG resting state functional networks in dyslexic readers
OBJECTIVE Neuroimaging research suggested a mixed pattern of functional connectivity abnormalities in developmental dyslexia. We examined differences in the topological properties of functional networks between 29 dyslexics and 15 typically reading controls in 3rd grade using graph analysis. Graph metrics characterize brain networks in terms of integration and segregation. METHOD We used EEG ...
متن کاملBrain Functional Connectivity Changes During Learning of Time Discrimination
The human brain is a complex system consist of connected nerve cells that adapts with and learn from the environment by changing its regional activities. Synchrony between these regional activities called functional network changes during the life, and with learning of new skills. Time perception and interval discrimination are among the most necessary skills for the human being to perceive mot...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Brain connectivity
دوره 6 4 شماره
صفحات -
تاریخ انتشار 2016